On Private-Key Cryptosystems Based on Product Codes
نویسندگان
چکیده
Recently J. and R.M. Campello de Souza proposed a private-key encryption scheme based on the product codes with the capability of correcting a special type of structured errors. In this paper, we show that J. and R.M. Campello de Souza’s scheme is insecure against chosen-plaintext attacks, and consequently propose a secure modified scheme.
منابع مشابه
A Formal Model for Systematic Design of Key Establishment Protocols
p. 1 The Security of Public Key Cryptosystems Based on Integer Factorization p. 9 A Uniform Approach to Securing Unix Applications Using SESAME p. 24 Integrated Management of Network and Host Based Security Mechanisms p. 36 Covert Distributed Computing Using Java Through Web Spoofing p. 48 Differential Cryptanalysis of a Block Cipher p. 58 On Private-Key Cryptosystems Based on Product Codes p. ...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملPrivate-Key Cryptosystems Based on Rank Metric
An analogue of McEliece’s cryptosystem, the Gabidulin-Paramonov-Trejtakov (GPT) public-key cryptosystem is based on rank-metric-based Gabidulin codes instead of Goppa codes. The GPT cryptosystem has attracted steady attention since it is much more robust against the decoding attacks and can therefore achieve the same level of security with much smaller keys. The key sizes, nonetheless, may stil...
متن کاملImprovements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes
Many public-key cryptosystems and identiication schemes based on error-correcting codes have been proposed as an alternative to the common cryptographic algorithms based on number theory. They rely on the NP-hardness of nding a xed-weight word in a coset of a linear binary code. We here improve the previous attacks on these systems; this notably enables us to reduce the work factor involved in ...
متن کاملOn the Security of Two Public Key Cryptosystems Using Non-Abelian Groups
The security of two public key encryption schemes relying on the hardness of different computational problems in non-abelian groups is investigated. First, an attack on a conceptual public key scheme based on Grigorchuk groups is presented: We show that from the public data one can easily derive an ‘equivalent’ secret key that allows the decryption of arbitrary messages encrypted under the publ...
متن کامل